Non-deterministic quantum programming
نویسندگان
چکیده
In standard computation, non-determinism is used for specifying programs’ behaviour, without having to specify details of implementation. In quantum computation, non-determinism is either meant to be “classical” probabilism or it is not considered at all, since quantum computation is the physical theory of computation and thus it does not deal with non-implementable features. In this work we will instead show that non-determinism may be useful also in quantum computation. In particular, we consider non-determinism embedded in a programming language for quantum computation, the quantum Guarded-Command Language (qGCL), and use that for describing and reasoning about counterfactual computation and mixed-state systems.
منابع مشابه
Multi-choice stochastic bi-level programming problem in cooperative nature via fuzzy programming approach
In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...
متن کاملFunctional Quantum Programming
It has been shown that non-determinism, both angelic and demonic, can be encoded in a functional language in different representation of sets. In this paper we see quantum programming as a special kind of non-deterministic programming where negative probabilities are allowed. The point is demonstrated by coding two simple quantum algorithms in Haskell. A monadic style of quantum programming is ...
متن کاملOn Quantum Pushdown Automata
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of quantum pushdown automata are not equiv...
متن کاملEffects of Probability Function on the Performance of Stochastic Programming
Stochastic programming is a valuable optimization tool where used when some or all of the design parameters of an optimization problem are defined by stochastic variables rather than by deterministic quantities. Depending on the nature of equations involved in the problem, a stochastic optimization problem is called a stochastic linear or nonlinear programming problem. In this paper,a stochasti...
متن کاملCharacterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal exponents in these relations are unknown. We show that the non-deterministic quantum query complexity of f is linearly related to the degree of a “non-deterministic” polynomial for f . We also prove a quantum-classical...
متن کامل